2BCA3 : DATA STRUCTURES USING C NOV/DEC 2009 QUESTION PAPER

                        II Semester B.C.A Examination ,Novemeber/December 2009
                                      O.S. Scheme
                                   Computer Science
                        2BCA3: DATA STRUCTURE USING C

TIme: 3 Hours                                                                Max.marks :80

Instruction :Answe all Sections.

PART-A

Answer any eight questions .      8 X 3 = 24

1.What are the operations performed on non-primitive data structures ?

2.Write a C program to concatenate two strings.

3.Explain recursion with an Example.

BCA 305: DATA STRUCTURE USING C OCT/NOV 2011 QUESTION PAPER

                                        III Semester B.C.A Degree Examination,OCT/NOV 2011
                                                                     Y2K8 SCHEME
                                                                COMPUTER SCIENCE
                                                  BCA 305:DATA  STRUCTURE USING C

TIME:3HOURS                                                       Max.marsk:60

Insturctions: Answer all Sections.

SECTION-A                                       10X1=10

1.What is linear data structure ? Give an example.

2.Give an example for binary search tree.

3.How do you intialize a ponter variable ?

BCA-305: DATA STRUCTURE USING C NOV/DEC 2010 QUESITON PAPERS

                          III Semester B.CA.Degree Examination. NOV/DEC 2010
                                                      Y2K8 SCHEME
                                           COMPUTER SCIECNCE
                           BCA 305:DATA STRUCTURE USING C

TIME:3HOURS                                       MAX.MARKS:60

INSTRUCTION: Answer all the sctions.

SECTION-A

Answer any 10 question.    1X10=10

1.Mention different operations performed on non primitive data structure.

2.Define time complexity of  an   algorithm.

3.Write one application of  stack.

BCA 204 DATA STRUCTURE USING C - MAY/JUNE 2010 QUESTION PAPER

                                II Semester B.C.A Examination ,May/June 2010
                                                   Y2K7 Scheme
                                            COMPUTER SCIENCE
                                    B.C.A 204 :Data Structure Using C

Time:3hours                                            Max Marsk:60

Instruction: Answer all Sections.

SECTION-A

Anwer any eight  questions. Each question carrires three marks .    8X3=24

1.Define data structure .Explain different types of data structure with an example

2.what is dynamic memory allocation? Explain any one dynamic memory allocation function.

3.Write the difference between iterative and recursive methods.

4.What is dangling pointer ? Explain with an example.

5.Write the applications of a Stack.